Multi-Task Clustering using Constrained Symmetric Non-Negative Matrix Factorization
نویسندگان
چکیده
Researchers have attempted to improve the quality of clustering solutions through various mechanisms. A promising new approach to improve clustering quality is to combine data from multiple related datasets (tasks) and apply multi-task clustering. In this paper, we present a novel framework that can simultaneously cluster multiple tasks through balanced Intra-Task (within-task) and Inter-Task (between-task) knowledge sharing. We propose an effective and flexible geometric affine transformation (contraction or expansion) of the distances between Inter-Task and Intra-Task instances. This transformation allows for an improved Intra-Task clustering without overwhelming the individual tasks with the bias accumulated from other tasks. A constrained low-rank decomposition of this multi-task transformation will allow us to maintain the class distribution of the clusters within each individual task. We impose an Intra-Task soft orthogonality constraint to a Symmetric Non-Negative Matrix Factorization (NMF) based formulation to generate basis vectors that are near orthogonal within each task. Inducing orthogonal basis vectors within each task imposes the prior knowledge that a task should have orthogonal (independent) clusters. Using several real-world experiments, we demonstrate that the proposed framework produces improves clustering quality compared to the state-of-the-art methods proposed in literature.
منابع مشابه
Clinical Document Clustering using Multi-view Non-Negative Matrix Factorization
Clinical document contains vital information like symptom names, medication names, age, gender and some demographical information. These information can be used for giving quick relief from a disease. In existing system, they had built a system for clustering symptom names and medication names using Multi-View Non-Negative Matrix Factorization. While considering the clinical documents the facto...
متن کاملDual Sparseness Constrained Nonnegative Matrix Factorization for Data Privacy and High Accuracy Utility ⋆
In this paper, we propose a data distortion strategy based on dual sparseness constrained Nonnegative Matrix Factorization (NMF). The dual sparseness constrained nonnegative matrix factorization model incorporates attached term constrain and positive symmetric matrix into NMF, which is different from the previous approaches. The goal of our study is data perturbation and we study the distortion...
متن کاملSoF: Soft-Cluster Matrix Factorization for Probabilistic Clustering
We propose SoF (Soft-cluster matrix Factorization), a probabilistic clustering algorithm which softly assigns each data point into clusters. Unlike model-based clustering algorithms, SoF does not make assumptions about the data density distribution. Instead, we take an axiomatic approach to define 4 properties that the probability of co-clustered pairs of points should satisfy. Based on the pro...
متن کاملRobust Multi-Relational Clustering via L1-Norm Symmetric Nonnegative Matrix Factorization
In this paper, we propose an `1-norm Symmetric Nonnegative Matrix TriFactorization (`1 S-NMTF) framework to cluster multi-type relational data by utilizing their interrelatedness. Due to introducing the `1-norm distances in our new objective function, the proposed approach is robust against noise and outliers, which are inherent in multi-relational data. We also derive the solution algorithm an...
متن کاملA new approach for building recommender system using non negative matrix factorization method
Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014